A structured pseudospectral method for H∞-norm computation of large-scale descriptor systems
نویسندگان
چکیده
In this paper we discuss the problem of computing the H∞-norm of transfer functions associated to large-scale descriptor systems. We exploit the relationship between the H∞-norm and the structured complex stability radius of a corresponding matrix pencil. To compute the structured stability radius we consider so-called structured pseudospectra. Namely, we have to find the pseudospectrum touching the imaginary axis. Therefore, we set up an iteration over the real part of the rightmost pseudoeigenvalue. For that we use a new fast iterative scheme which is based on certain rank-1 perturbations of a matrix pencil. Finally, we analyze the performance of our algorithm by using real-world examples. In particular we compare our method with different other algorithms including a recently and independently derived method from Guglielmi, Gürbüzbalaban, and Overton.
منابع مشابه
L∞-Norm Computation for Large-Scale Descriptor Systems Using Structured Iterative Eigensolvers
In this report, we implement a method for computing L∞-norms for descriptor systems using structured iterative eigensolvers. In particular, the algorithm computes some desired imaginary eigenvalues of an even matrix pencil and uses them to determine an upper and lower bound to the L∞-norm. We finally compare our method to a previously developed algorithm using structured pseudospectra. Numerica...
متن کاملH∞-Norm Computation for Large and Sparse Descriptor Systems
In this paper we discuss the problem of computing the H∞-norms of transfer functions associated to large-scale descriptor systems. We exploit the relationship between the H∞-norm and the structured complex stability radius of the corresponding system pencil. To compute the structured stability radius we consider so-called structured pseudospectra. Namely, we have to find the pseudospectrum that...
متن کاملApproximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations
We propose a fast method to approximate the real stability radius of a linear dynamical system with output feedback, where the perturbations are restricted to be real valued and bounded with respect to the Frobenius norm. Our work builds on a number of scalable algorithms that have been proposed in recent years, ranging from methods that approximate the complex or real pseudospectral abscissa a...
متن کاملRobust and Efficient Algorithms for L<sub></sub>-Norm Computation for Descriptor Systems
In this paper we discuss algorithms for the computation of the L∞-norm of transfer functions related to descriptor systems, both in the continuousand discrete-time context. We show how one can achieve this goal by computing the eigenvalues of certain structured matrix pencils. These pencils can be transformed to skew-Hamiltonian/Hamiltonian matrix pencils which are constructed by only using the...
متن کاملRobust and Efficient Algorithms for L∞ -Norm Computation for Descriptor Systems
In this paper we discuss algorithms for the computation of the L∞-norm of transfer functions related to descriptor systems, both in the continuousand discrete-time context. We show how one can achieve this goal by computing the eigenvalues of certain structured matrix pencils. These pencils can be transformed to skew-Hamiltonian/Hamiltonian matrix pencils which are constructed by only using the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- MCSS
دوره 26 شماره
صفحات -
تاریخ انتشار 2014